package leetcode.code0852;

public class Solution {
	public int peakIndexInMountainArray(int[] arr) {
		int ans = 0;
		for (int i = 1; i < arr.length; i++) {
			if (arr[i] > arr[i - 1]) {
				ans = i;
			} else {
				return ans;
			}
		}
		return ans;
	}
	

}
